Computing the Hessenberg matrix associated with a self-similar measure
نویسندگان
چکیده
We introduce in this paper a method to calcúlate the Hessenberg matrix of a sum of measures from the Hessenberg matrices of the component measures. Our method extends the spectral techniques used by G. Mantica to calcúlate the Jacobi matrix associated with a sum of measures from the Jacobi matrices of each of the measures. We apply this method to approximate the Hessenberg matrix associated with a self-similar measure and compare it with the result obtained by a former method for self-similar measures which uses a flxed point theorem for moment matrices. Results are given for a series of classical examples of self-similar measures. Finally, we also apply the method introduced in this paper to some examples of sums of (not self-similar) measures obtaining the exact valué of the sections of the Hessenberg matrix. © 2010 Elsevier Inc. All rights reserved.
منابع مشابه
On the sum of Pell and Jacobsthal numbers by matrix method
In this paper, we define two $n$-square upper Hessenberg matrices one of which corresponds to the adjacency matrix of a directed pseudo graph. We investigate relations between permanents and determinants of these upper Hessenberg matrices, and sum formulas of the well-known Pell and Jacobsthal sequences. Finally, we present two Maple 13 procedures in order to calculate permanents of t...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملParallel Two-Stage Hessenberg Reduction using Tile Algorithms for Multicore Architectures
This paper describes a parallel Hessenberg reduction in the context of multicore architectures using tile algorithms. The Hessenberg reduction is very often used as a pre-processing step in solving dense linear algebra problems, such as the standard eigenvalue problem. Although expensive, orthogonal transformations are accepted techniques and commonly used for this reduction because they guaran...
متن کاملQR-type iterations for eigenvalue computations based on factorizations of unitary matrices in rotations
The QR-algorithm is a renowned method for computing all eigenvalues of an arbitrary matrix. A preliminary unitary similarity transformation to Hessenberg form is indispensible for keeping the computational complexity of the QRalgorithm applied on the resulting Hessenberg matrix under control. The unitary factor Q in the QR-factorization of the Hessenberg matrix H = QR is composed of n − 1 rotat...
متن کاملAn Efficient QR Algorithm for a Hessenberg Submatrix of a Unitary Matrix
We describe an efficient procedure for implementing the Hessenberg QR algorithm on a class of matrices that we refer to as subunitary matrices. This class includes the set of Szegő-Hessenberg matrices, whose characteristic polynomials are Szegő polynomials, i.e., polynomials orthogonal with respect to a measure on the unit circle in the complex plane. Computing the zeros of Szegő polynomials is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 163 شماره
صفحات -
تاریخ انتشار 2011